Realizing Brouwer's sequences
نویسندگان
چکیده
منابع مشابه
Realizing Degree Sequences in Parallel
A sequence d of integers is a degree sequence if there exists a (simple) graph G such that the components of d are equal to the degrees of the vertices of G. The graph G is said to be a realization of d. We provide an efficient parallel algorithm to realize d; the algorithm runs in O(logn) time using O(n+m) CRCW PRAM processors, where n and m are the number of vertices and edges in G. Before ou...
متن کاملRealizing degree sequences as Z3-connected graphs
An integer-valued sequence π = (d1, . . . , dn) is graphic if there is a simple graph G with degree sequence of π . We say the π has a realization G. Let Z3 be a cyclic group of order three. A graph G is Z3-connected if for every mapping b : V (G) → Z3 such that v∈V (G) b(v) = 0, there is an orientation of G and amapping f : E(G) → Z3−{0} such that for each vertex v ∈ V (G), the sum of the va...
متن کاملRealizing Degree Sequences with Graphs Having Nowhere-Zero 3-Flows
The following open problem was proposed by Archdeacon: Characterize all graphical sequences π such that some realization of π admits a nowhere-zero 3-flow. This open problem is solved in this paper with the following complete characterization: A graphical sequence π = (d1, d2, . . . , dn) with minimum degree at least two has a realization that admits a nowhere-zero 3-flow if and only if π 6= (3...
متن کاملRealizing degree sequences with k-edge-connected uniform hypergraphs
An integral sequence d = (d1, d2, . . . , dn) is hypergraphic if there is a simple hypergraph H with degree sequence d, and such a hypergraph H is a realization of d. A sequence d is r-uniform hypergraphic if there is a simple r-uniform hypergraph with degree sequence d. Similarly, a sequence d is r-uniformmulti-hypergraphic if there is an r-uniformhypergraph (possibly with multiple edges) with...
متن کاملAlgorithms for realizing degree sequences of directed graphs
The Havel-Hakimi algorithm for constructing realizations of degree sequences for undirected graphs has been used extensively in the literature. A result by Kleitman and Wang extends the Havel-Hakimi algorithm to degree sequences for directed graphs. In this paper we go a step further and describe a modification of Kleitman and Wang’s algorithm that is a more natural extension of Havel-Hakimi’s ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annals of Pure and Applied Logic
سال: 1996
ISSN: 0168-0072
DOI: 10.1016/0168-0072(94)00047-6